Public Key Encryption with Keyword Search Based on K-Resilient IBE
نویسنده
چکیده
An encrypted email is sent from Bob to Alice. A gateway wants to check whether a certain keyword exists in an email or not for some reason (e.g. routing). Nevertheless Alice does not want the email to be decrypted by anyone except her including the gateway itself. This is a scenario where public key encryption with keyword search (PEKS) is needed. In this paper we construct a new scheme (KR-PEKS) the KResilient Public Key Encryption with Keyword Search. The new scheme is secure under a chosen keyword attack without the random oracle. The ability of constructing a Public Key Encryption with Keyword Search from an Identity Based Encryption was used in the construction of the KR-PEKS. The security of the new scheme was proved by showing that the used IBE has a notion of key privacy. The scheme was then modified in two different ways in order to fulfill each of the following: the first modification was done to enable multiple keyword search and the other was done to remove the need of secure channels.
منابع مشابه
Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data
Searchable encryption schemes provide an important mechanism to cryptographically protect data while keeping it available to be searched and accessed. In a common approach for their construction, the encrypting entity chooses one or several keywords that describe the content of each encrypted record of data. To perform a search, a user obtains a trapdoor for a keyword of her interest and uses t...
متن کاملSurvey on Searchable Public-key Cipher Texts for Privacy Preserving Keyword Search
The Public Key Encryption along with Keyword Search allows one to search the data that is in encrypted form with a keyword without showing any information. This paper gives the detail study on searchable Public-Key Ciphertexts with Hidden Structures (SPCHS) that fastenthe keyword search without sacrificing the security of encrypted keywords. In SPCHS, the keyword ciphertexts is structured by hi...
متن کاملGeneralized (identity-based) hash proof system and its applications
In this work, we generalize the paradigm of hash proof system (HPS) proposed by Cramer and Shoup [CS02]. In the central of our generalization, we lift subset membership problem to distribution distinguish problem. Our generalized HPS clarifies and encompass all the known publickey encryption (PKE) schemes that essentially implement the idea of hash proof system. Moreover, besides existing smoot...
متن کاملAdaptive Secure-Channel Free Public-Key Encryption with Keyword Search Implies Timed Release Encryption
As well-known results, timed-release encryption (TRE) and public key encryption scheme with keyword search (PEKS) are very close to identity-based encryption (IBE), respectively. It seems natural that there is a close relationship between TRE and PEKS. However, no explicit bridge has been shown between TRE and PEKS so far. In this paper, we show that TRE can be generically constructed by PEKS w...
متن کاملA New Approach for Private Searches on Public-Key Encrypted Data
Public-key Encryption with Keyword Search (PEKS) allows authorized users to search by keywords on encrypted data by generating trapdoors for the desired keywords. Basically there are two requirements for the process of trapdoors generation. On one hand, it is important to allow users to privately search on encrypted data without revealing keywords to the Trapdoor Generation Entity T GE , and so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006